Higher Order Optimality and Duality in Vector Optimization
ثبت نشده
چکیده
In section 4.1 a new class of higher order (F,ρi, σj)type I functions are introduced for a vector minimization problem. Various known generalized invex functions such as type-I, second order type-I and second order (F,ρi,σj)-type I are particular cases of higher order (F, ρi, σj)-type I functions. This class of functions is used to establish higher order duality results for a nondifferentiable multiobjective fractional programming problem whose objective functions and constraints contain support functions of compact convex sets in n R . Higher order Mond-Weir type and Schaible type duals are formulated for the multiobjective fractional program and various duality results are established. It has been observed that these primal and dual pairs when appropriately specialized, reduce to the classes of problems with multiple, fractional, and conventional objective functions considered in [57], [58], [59], [161], and [163].
منابع مشابه
Sufficiency and duality for a nonsmooth vector optimization problem with generalized $alpha$-$d_{I}$-type-I univexity over cones
In this paper, using Clarke’s generalized directional derivative and dI-invexity we introduce new concepts of nonsmooth K-α-dI-invex and generalized type I univex functions over cones for a nonsmooth vector optimization problem with cone constraints. We obtain some sufficient optimality conditions and Mond-Weir type duality results under the foresaid generalized invexity and type I cone-univexi...
متن کاملDuality for vector equilibrium problems with constraints
In the paper, we study duality for vector equilibrium problems using a concept of generalized convexity in dealing with the quasi-relative interior. Then, their applications to optimality conditions for quasi-relative efficient solutions are obtained. Our results are extensions of several existing ones in the literature when the ordering cones in both the objective space and the constr...
متن کاملHigher-Order Minimizers and Generalized -Convexity in Nonsmooth Vector Optimization over Cones
In this paper, we introduce the concept of a (weak) minimizer of order k for a nonsmooth vector optimization problem over cones. Generalized classes of higher-order cone-nonsmooth (F, ρ)convex functions are introduced and sufficient optimality results are proved involving these classes. Also, a unified dual is associated with the considered primal problem, and weak and strong duality results ar...
متن کاملSecond-order optimality and duality in vector optimization over cones
In this paper, we introduce the notion of a second-order coneconvex function involving second-order directional derivative. Also, second-order cone-pseudoconvex, second-order cone-quasiconvex and other related functions are defined. Second-order optimality and Mond-Weir type duality results are derived for a vector optimization problem over cones using the introduced classes of functions.
متن کاملA note on symmetric duality in vector optimization problems
In this paper, we establish weak and strong duality theorems for a pair of multiobjective symmetric dual problems. This removes several omissions in the paper "Symmetric and self duality in vector optimization problem, Applied Mathematics and Computation 183 (2006) 1121-1126".
متن کاملPareto Optimality Conditions and Duality for Vector Quadratic Fractional Optimization Problems
One of the most important optimality conditions to aid in solving a vector optimization problem is the first-order necessary optimality condition that generalizes the Karush-Kuhn-Tucker condition. However, to obtain the sufficient optimality conditions, it is necessary to impose additional assumptions on the objective functions and on the constraint set.The present work is concerned with the co...
متن کامل